Relations of completeness

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Relations and #P-Completeness

This paper follows the methodology introduced by Agrawal and Biswas in [AB92], based on a notion of universality for the relations associated with NP-complete problems. The purpose was to study NP-complete problems by examining the effects of reductions on the solution sets of the associated witnessing relations. This provided a useful criterion for NP-completeness while suggesting structural s...

متن کامل

Combining Preference Relations: Completeness and Consistency

We introduce two criteria for judging “goodness” of the result when combining preference relations in information systems: completeness and consistency. Completeness requires that the result must be the union of all preference relations, while consistency requires that the result must be an acyclic relation. In other words, completeness requires that the result contain all pairs appearing in th...

متن کامل

On Completeness of Logical Relations for Monadic Types

Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting properties can be expressed formally by contextual equivalence (a.k.a. observational equivalence). Furthermore, imperative features, which exist in most real-lif...

متن کامل

Completeness in the Theory of Properties, Relations, and Propositions

Higher-order theories of properties, relations, and propositions (PRPs) are known to be essentially incomplete relative to their standard notions of validity.2 There is, however, a first-order theory of PRPs that results when standard firstorder logic is supplemented with an operation of intensional abstraction. It turns out that this first-order theory of PRPs is provably complete with respect...

متن کامل

A note on I-completeness of NP-witnessing relations

In this note, we study under which conditions various sets (even easy ones) can be associated with a witnessing relation that is #P complete. We show a sufficient condition for an NP set to have such a relation. This condition applies also to many NP-complete sets, as well as to many sets in P .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1962

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1962.100525